Optimization of Cable Logging Layout Using a Heuristic Algorithm for Network Programming

نویسنده

  • Woodam Chung
چکیده

This paper describes a methodology for optimizing cable logging layout using a heuristic network algorithm. The methodology formulates a cable logging layout as a network problem. Each grid cell containing timber volume to be harvested is identified as an individual entry node of the network. Mill locations or proposed timber exit locations are identified as destinations. Then, each origin will be connected to one of destinations through alternative links representing different cable roads, harvesting equipment, landing locations, and truck road segments. A computerized model incorporating the methodology is introduced. The model is intended to optimize landing, harvest equipment, logging profile, and road location simultaneously using information from GIS layers. A heuristic method for network programming is used as an optimization technique in the model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mixed Integer Programming Approach to Optimal Feeder Routing for Tree-Based Distribution System: A Case Study

A genetic algorithm is proposed to optimize a tree-structured power distribution network considering optimal cable sizing. For minimizing the total cost of the network, a mixed-integer programming model is presented determining the optimal sizes of cables with minimized location-allocation cost. For designing the distribution lines in a power network, the primary factors must be considered as m...

متن کامل

Network Planning Using Iterative Improvement Methods and Heuristic Techniques

The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...

متن کامل

A heuristic method for combined optimization of layout design and cluster configuration in continuous productions

Facility layout problems have been generally solved either hierarchically or integrated into other phases of plant design. In this paper, a hybrid method is introduced so that clustering and facilities layout can be simultaneously optimized. Each cluster is formed by a group of connected facilities and selection of the most appropriate cluster configuration is aimed. Since exact method by MIP i...

متن کامل

Optimization of Hospital Layout through the Application of Heuristic Technique (Diamond Algorithm) in Shafa Hospital (2009)

INTRODUCTION: The appropriate-use optimization of the limited spaces of the Iranian hospitals is believed to be a crucial step towards promoting the efficiency of these healthcare centers. The issue determining the optimization patterns of the layout of units has led to a lot of efforts by researchers as it increases the efficiency of the hospitals through patients’ improvement, changing the lo...

متن کامل

ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010